Master-Slave TLBO Algorithm for Constrained Global Optimization Problems

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

a new hybrid flower pollination algorithm for solving constrained global optimization problems

global optimization methods play an important role to solve many real-world problems. flower pollination algorithm (fp) is a new nature-inspired algorithm, based on the characteristics of flowering plants. in this paper, a new hybrid optimization method called hybrid flower pollination algorithm (fppso) is proposed. the method combines the standard flower pollination algorithm (fp) with the par...

Topographical Global Optimization for Constrained Problems

In topographical global optimization a sample of points that superuniformly cover the region of interest, A, is used in combination with the function evaluations in these points to obtain a topographical graph of A from which candidate points are easily extracted for local minimizations. This paper discusses some of the problems in obtaining such a cover and presents some solutions. These solut...

Global optimization algorithms for bound constrained problems

Scheduling problems in master-slave model

We consider scheduling problems in the master slave model, which was introduced by Sahni in 1996. The goal is to minimize the makespan and the total completion time. It has been shown that the problem of minimizing makespan is NP-hard. Sahni and Vairaktarakis developed some approximation algorithms to generate schedules whose makespan is at most constant times the optimal. In this paper, we sho...